Freelog 125/Freelog_MarsAvril2015_No125.iso/Musique/Quod Libet/quodlibet-3.3.0-portable.exe/quodlibet-3.3.0-portable/data/bin/collections.pyc

Python Compiled Bytecode | 2014-12-31 | 24KB | 640 lines

# Source Generated with Decompyle++
# File: in.pyc (Python 2.7)

__all__ = [
    'Counter',
    'deque',
    'defaultdict',
    'namedtuple',
    'OrderedDict']
from _abcoll import *
import _abcoll
__all__ += _abcoll.__all__
from _collections import deque, defaultdict
from operator import itemgetter as _itemgetter, eq as _eq
from keyword import iskeyword as _iskeyword
import sys as _sys
import heapq as _heapq
from itertools import repeat as _repeat, chain as _chain, starmap as _starmap
from itertools import imap as _imap

try:
    from thread import get_ident as _get_ident
except ImportError:
    from dummy_thread import get_ident as _get_ident


class OrderedDict(dict):
    '''Dictionary that remembers insertion order'''

    def __init__(self, *args, **kwds):
        '''Initialize an ordered dictionary.  The signature is the same as
        regular dictionaries, but keyword arguments are not recommended because
        their insertion order is arbitrary.

        '''
        if len(args) > 1:
            raise TypeError('expected at most 1 arguments, got %d' % len(args))

        try:
            self._OrderedDict__root
        except AttributeError:
            self._OrderedDict__root = root = []
            root[:] = [
                root,
                root,
                None]
            self._OrderedDict__map = { }

        self._OrderedDict__update(*args, **kwds)


    def __setitem__(self, key, value, dict_setitem = dict.__setitem__):
        '''od.__setitem__(i, y) <==> od[i]=y'''
        if key not in self:
            root = self._OrderedDict__root
            last = root[0]
            last[1] = root[0] = self._OrderedDict__map[key] = [
                last,
                root,
                key]
        return dict_setitem(self, key, value)


    def __delitem__(self, key, dict_delitem = dict.__delitem__):
        '''od.__delitem__(y) <==> del od[y]'''
        dict_delitem(self, key)
        (link_prev, link_next, _) = self._OrderedDict__map.pop(key)
        link_prev[1] = link_next
        link_next[0] = link_prev


    def __iter__(self):
        '''od.__iter__() <==> iter(od)'''
        root = self._OrderedDict__root
        curr = root[1]
        while curr is not root:
            yield curr[2]
            curr = curr[1]


    def __reversed__(self):
        '''od.__reversed__() <==> reversed(od)'''
        root = self._OrderedDict__root
        curr = root[0]
        while curr is not root:
            yield curr[2]
            curr = curr[0]


    def clear(self):
        '''od.clear() -> None.  Remove all items from od.'''
        root = self._OrderedDict__root
        root[:] = [
            root,
            root,
            None]
        self._OrderedDict__map.clear()
        dict.clear(self)


    def keys(self):
        '''od.keys() -> list of keys in od'''
        return list(self)


    def values(self):
        '''od.values() -> list of values in od'''
        return [ self[key] for key in self ]


    def items(self):
        '''od.items() -> list of (key, value) pairs in od'''
        return [ (key, self[key]) for key in self ]


    def iterkeys(self):
        '''od.iterkeys() -> an iterator over the keys in od'''
        return iter(self)


    def itervalues(self):
        '''od.itervalues -> an iterator over the values in od'''
        for k in self:
            yield self[k]



    def iteritems(self):
        '''od.iteritems -> an iterator over the (key, value) pairs in od'''
        for k in self:
            yield (k, self[k])


    update = MutableMapping.update
    __update = update
    __marker = object()

    def pop(self, key, default = __marker):
        '''od.pop(k[,d]) -> v, remove specified key and return the corresponding
        value.  If key is not found, d is returned if given, otherwise KeyError
        is raised.

        '''
        if key in self:
            result = self[key]
            del self[key]
            return result
        if None is self._OrderedDict__marker:
            raise KeyError(key)
        return default


    def setdefault(self, key, default = None):
        '''od.setdefault(k[,d]) -> od.get(k,d), also set od[k]=d if k not in od'''
        if key in self:
            return self[key]
        self[key] = None
        return default


    def popitem(self, last = True):
        '''od.popitem() -> (k, v), return and remove a (key, value) pair.
        Pairs are returned in LIFO order if last is true or FIFO order if false.

        '''
        if not self:
            raise KeyError('dictionary is empty')
        key = next(reversed(self) if last else iter(self))
        value = self.pop(key)
        return (key, value)


    def __repr__(self, _repr_running = { }):
        '''od.__repr__() <==> repr(od)'''
        call_key = (id(self), _get_ident())
        if call_key in _repr_running:
            return '...'
        _repr_running[call_key] = None

        try:
            if not self:
                return '%s()' % (self.__class__.__name__,)
            return None % (self.__class__.__name__, self.items())
        finally:
            del _repr_running[call_key]



    def __reduce__(self):
        '''Return state information for pickling'''
        items = [ [
            k,
            self[k]] for k in self ]
        inst_dict = vars(self).copy()
        for k in vars(OrderedDict()):
            inst_dict.pop(k, None)

        if inst_dict:
            return (self.__class__, (items,), inst_dict)
        return (None.__class__, (items,))


    def copy(self):
        '''od.copy() -> a shallow copy of od'''
        return self.__class__(self)


    def fromkeys(cls, iterable, value = None):
        '''OD.fromkeys(S[, v]) -> New ordered dictionary with keys from S.
        If not specified, the value defaults to None.

        '''
        self = cls()
        for key in iterable:
            self[key] = value

        return self

    fromkeys = classmethod(fromkeys)

    def __eq__(self, other):
        '''od.__eq__(y) <==> od==y.  Comparison to another OD is order-sensitive
        while comparison to a regular mapping is order-insensitive.

        '''
        if isinstance(other, OrderedDict):
            if dict.__eq__(self, other):
                pass
            return all(_imap(_eq, self, other))
        return None.__eq__(self, other)


    def __ne__(self, other):
        '''od.__ne__(y) <==> od!=y'''
        return not (self == other)


    def viewkeys(self):
        """od.viewkeys() -> a set-like object providing a view on od's keys"""
        return KeysView(self)


    def viewvalues(self):
        """od.viewvalues() -> an object providing a view on od's values"""
        return ValuesView(self)


    def viewitems(self):
        """od.viewitems() -> a set-like object providing a view on od's items"""
        return ItemsView(self)


_class_template = "class {typename}(tuple):\n    '{typename}({arg_list})'\n\n    __slots__ = ()\n\n    _fields = {field_names!r}\n\n    def __new__(_cls, {arg_list}):\n        'Create new instance of {typename}({arg_list})'\n        return _tuple.__new__(_cls, ({arg_list}))\n\n    @classmethod\n    def _make(cls, iterable, new=tuple.__new__, len=len):\n        'Make a new {typename} object from a sequence or iterable'\n        result = new(cls, iterable)\n        if len(result) != {num_fields:d}:\n            raise TypeError('Expected {num_fields:d} arguments, got %d' % len(result))\n        return result\n\n    def __repr__(self):\n        'Return a nicely formatted representation string'\n        return '{typename}({repr_fmt})' % self\n\n    def _asdict(self):\n        'Return a new OrderedDict which maps field names to their values'\n        return OrderedDict(zip(self._fields, self))\n\n    def _replace(_self, **kwds):\n        'Return a new {typename} object replacing specified fields with new values'\n        result = _self._make(map(kwds.pop, {field_names!r}, _self))\n        if kwds:\n            raise ValueError('Got unexpected field names: %r' % kwds.keys())\n        return result\n\n    def __getnewargs__(self):\n        'Return self as a plain tuple.  Used by copy and pickle.'\n        return tuple(self)\n\n    __dict__ = _property(_asdict)\n\n    def __getstate__(self):\n        'Exclude the OrderedDict from pickling'\n        pass\n\n{field_defs}\n"
_repr_template = '{name}=%r'
_field_template = "    {name} = _property(_itemgetter({index:d}), doc='Alias for field number {index:d}')\n"

def namedtuple(typename, field_names, verbose = False, rename = False):
    """Returns a new subclass of tuple with named fields.

    >>> Point = namedtuple('Point', ['x', 'y'])
    >>> Point.__doc__                   # docstring for the new class
    'Point(x, y)'
    >>> p = Point(11, y=22)             # instantiate with positional args or keywords
    >>> p[0] + p[1]                     # indexable like a plain tuple
    33
    >>> x, y = p                        # unpack like a regular tuple
    >>> x, y
    (11, 22)
    >>> p.x + p.y                       # fields also accessable by name
    33
    >>> d = p._asdict()                 # convert to a dictionary
    >>> d['x']
    11
    >>> Point(**d)                      # convert from a dictionary
    Point(x=11, y=22)
    >>> p._replace(x=100)               # _replace() is like str.replace() but targets named fields
    Point(x=100, y=22)

    """
    if isinstance(field_names, basestring):
        field_names = field_names.replace(',', ' ').split()
    field_names = map(str, field_names)
    if rename:
        seen = set()
        for index, name in enumerate(field_names):
            if not all((lambda .0: pass)(name)) and _iskeyword(name) and not name and name[0].isdigit() and name.startswith('_') or name in seen:
                field_names[index] = '_%d' % index
            seen.add(name)

    for name in [
        typename] + field_names:
        if not all((lambda .0: pass)(name)):
            raise ValueError('Type names and field names can only contain alphanumeric characters and underscores: %r' % name)
        if _iskeyword(name):
            raise ValueError('Type names and field names cannot be a keyword: %r' % name)
        if name[0].isdigit():
            raise ValueError('Type names and field names cannot start with a number: %r' % name)

    seen = set()
    for name in field_names:
        if name.startswith('_') and not rename:
            raise ValueError('Field names cannot start with an underscore: %r' % name)
        if name in seen:
            raise ValueError('Encountered duplicate field name: %r' % name)
        seen.add(name)

    class_definition = _class_template.format(typename = typename, field_names = tuple(field_names), num_fields = len(field_names), arg_list = repr(tuple(field_names)).replace("'", '')[1:-1], repr_fmt = ', '.join((lambda .0: pass)(field_names)), field_defs = '\n'.join((lambda .0: pass)(enumerate(field_names))))
    if verbose:
        print class_definition
    namespace = dict(_itemgetter = _itemgetter, __name__ = 'namedtuple_%s' % typename, OrderedDict = OrderedDict, _property = property, _tuple = tuple)

    try:
        exec class_definition in namespace
    except SyntaxError:
        e = None
        raise SyntaxError(e.message + ':\n' + class_definition)

    result = namespace[typename]

    try:
        result.__module__ = _sys._getframe(1).f_globals.get('__name__', '__main__')
    except (AttributeError, ValueError):
        pass

    return result


class Counter(dict):
    """Dict subclass for counting hashable items.  Sometimes called a bag
    or multiset.  Elements are stored as dictionary keys and their counts
    are stored as dictionary values.

    >>> c = Counter('abcdeabcdabcaba')  # count elements from a string

    >>> c.most_common(3)                # three most common elements
    [('a', 5), ('b', 4), ('c', 3)]
    >>> sorted(c)                       # list all unique elements
    ['a', 'b', 'c', 'd', 'e']
    >>> ''.join(sorted(c.elements()))   # list elements with repetitions
    'aaaaabbbbcccdde'
    >>> sum(c.values())                 # total of all counts
    15

    >>> c['a']                          # count of letter 'a'
    5
    >>> for elem in 'shazam':           # update counts from an iterable
    ...     c[elem] += 1                # by adding 1 to each element's count
    >>> c['a']                          # now there are seven 'a'
    7
    >>> del c['b']                      # remove all 'b'
    >>> c['b']                          # now there are zero 'b'
    0

    >>> d = Counter('simsalabim')       # make another counter
    >>> c.update(d)                     # add in the second counter
    >>> c['a']                          # now there are nine 'a'
    9

    >>> c.clear()                       # empty the counter
    >>> c
    Counter()

    Note:  If a count is set to zero or reduced to zero, it will remain
    in the counter until the entry is deleted or the counter is cleared:

    >>> c = Counter('aaabbc')
    >>> c['b'] -= 2                     # reduce the count of 'b' by two
    >>> c.most_common()                 # 'b' is still in, but its count is zero
    [('a', 3), ('c', 1), ('b', 0)]

    """

    def __init__(self, iterable = None, **kwds):
        """Create a new, empty Counter object.  And if given, count elements
        from an input iterable.  Or, initialize the count from another mapping
        of elements to their counts.

        >>> c = Counter()                           # a new, empty counter
        >>> c = Counter('gallahad')                 # a new counter from an iterable
        >>> c = Counter({'a': 4, 'b': 2})           # a new counter from a mapping
        >>> c = Counter(a=4, b=2)                   # a new counter from keyword args

        """
        super(Counter, self).__init__()
        self.update(iterable, **kwds)


    def __missing__(self, key):
        '''The count of elements not in the Counter is zero.'''
        return 0


    def most_common(self, n = None):
        """List the n most common elements and their counts from the most
        common to the least.  If n is None, then list all element counts.

        >>> Counter('abcdeabcdabcaba').most_common(3)
        [('a', 5), ('b', 4), ('c', 3)]

        """
        if n is None:
            return sorted(self.iteritems(), key = _itemgetter(1), reverse = True)
        return None.nlargest(n, self.iteritems(), key = _itemgetter(1))


    def elements(self):
        """Iterator over elements repeating each as many times as its count.

        >>> c = Counter('ABCABC')
        >>> sorted(c.elements())
        ['A', 'A', 'B', 'B', 'C', 'C']

        # Knuth's example for prime factors of 1836:  2**2 * 3**3 * 17**1
        >>> prime_factors = Counter({2: 2, 3: 3, 17: 1})
        >>> product = 1
        >>> for factor in prime_factors.elements():     # loop over factors
        ...     product *= factor                       # and multiply them
        >>> product
        1836

        Note, if an element's count has been set to zero or is a negative
        number, elements() will ignore it.

        """
        return _chain.from_iterable(_starmap(_repeat, self.iteritems()))


    def fromkeys(cls, iterable, v = None):
        raise NotImplementedError('Counter.fromkeys() is undefined.  Use Counter(iterable) instead.')

    fromkeys = classmethod(fromkeys)

    def update(self, iterable = None, **kwds):
        """Like dict.update() but add counts instead of replacing them.

        Source can be an iterable, a dictionary, or another Counter instance.

        >>> c = Counter('which')
        >>> c.update('witch')           # add elements from another iterable
        >>> d = Counter('watch')
        >>> c.update(d)                 # add elements from another counter
        >>> c['h']                      # four 'h' in which, witch, and watch
        4

        """
        if iterable is not None:
            if isinstance(iterable, Mapping):
                if self:
                    self_get = self.get
                    for elem, count in iterable.iteritems():
                        self[elem] = self_get(elem, 0) + count

                else:
                    super(Counter, self).update(iterable)
            else:
                self_get = self.get
                for elem in iterable:
                    self[elem] = self_get(elem, 0) + 1

        if kwds:
            self.update(kwds)


    def subtract(self, iterable = None, **kwds):
        """Like dict.update() but subtracts counts instead of replacing them.
        Counts can be reduced below zero.  Both the inputs and outputs are
        allowed to contain zero and negative counts.

        Source can be an iterable, a dictionary, or another Counter instance.

        >>> c = Counter('which')
        >>> c.subtract('witch')             # subtract elements from another iterable
        >>> c.subtract(Counter('watch'))    # subtract elements from another counter
        >>> c['h']                          # 2 in which, minus 1 in witch, minus 1 in watch
        0
        >>> c['w']                          # 1 in which, minus 1 in witch, minus 1 in watch
        -1

        """
        if iterable is not None:
            self_get = self.get
            if isinstance(iterable, Mapping):
                for elem, count in iterable.items():
                    self[elem] = self_get(elem, 0) - count

            else:
                for elem in iterable:
                    self[elem] = self_get(elem, 0) - 1

        if kwds:
            self.subtract(kwds)


    def copy(self):
        '''Return a shallow copy.'''
        return self.__class__(self)


    def __reduce__(self):
        return (self.__class__, (dict(self),))


    def __delitem__(self, elem):
        '''Like dict.__delitem__() but does not raise KeyError for missing values.'''
        if elem in self:
            super(Counter, self).__delitem__(elem)


    def __repr__(self):
        if not self:
            return '%s()' % self.__class__.__name__
        items = None.join(map('%r: %r'.__mod__, self.most_common()))
        return '%s({%s})' % (self.__class__.__name__, items)


    def __add__(self, other):
        """Add counts from two counters.

        >>> Counter('abbb') + Counter('bcc')
        Counter({'b': 4, 'c': 2, 'a': 1})

        """
        if not isinstance(other, Counter):
            return NotImplemented
        result = None()
        for elem, count in self.items():
            newcount = count + other[elem]
            if newcount > 0:
                result[elem] = newcount
                continue
        for elem, count in other.items():
            if elem not in self and count > 0:
                result[elem] = count
                continue
        return result


    def __sub__(self, other):
        """ Subtract count, but keep only results with positive counts.

        >>> Counter('abbbc') - Counter('bccd')
        Counter({'b': 2, 'a': 1})

        """
        if not isinstance(other, Counter):
            return NotImplemented
        result = None()
        for elem, count in self.items():
            newcount = count - other[elem]
            if newcount > 0:
                result[elem] = newcount
                continue
        for elem, count in other.items():
            if elem not in self and count < 0:
                result[elem] = 0 - count
                continue
        return result


    def __or__(self, other):
        """Union is the maximum of value in either of the input counters.

        >>> Counter('abbb') | Counter('bcc')
        Counter({'b': 3, 'c': 2, 'a': 1})

        """
        if not isinstance(other, Counter):
            return NotImplemented
        result = None()
        for elem, count in self.items():
            other_count = other[elem]
            newcount = other_count if count < other_count else count
            if newcount > 0:
                result[elem] = newcount
                continue
        for elem, count in other.items():
            if elem not in self and count > 0:
                result[elem] = count
                continue
        return result


    def __and__(self, other):
        """ Intersection is the minimum of corresponding counts.

        >>> Counter('abbb') & Counter('bcc')
        Counter({'b': 1})

        """
        if not isinstance(other, Counter):
            return NotImplemented
        result = None()
        for elem, count in self.items():
            other_count = other[elem]
            newcount = count if count < other_count else other_count
            if newcount > 0:
                result[elem] = newcount
                continue
        return result


if __name__ == '__main__':
    from cPickle import loads, dumps
    Point = namedtuple('Point', 'x, y', True)
    p = Point(x = 10, y = 20)
    if not p == loads(dumps(p)):
        raise AssertionError

    class Point(namedtuple('Point', 'x y')):
        __slots__ = ()

        def hypot(self):
            return (self.x ** 2 + self.y ** 2) ** 0.5

        hypot = property(hypot)

        def __str__(self):
            return 'Point: x=%6.3f  y=%6.3f  hypot=%6.3f' % (self.x, self.y, self.hypot)


    for p in (Point(3, 4), Point(14, 5 / 7)):
        print p


    class Point(namedtuple('Point', 'x y')):
        '''Point class with optimized _make() and _replace() without error-checking'''
        __slots__ = ()
        _make = classmethod(tuple.__new__)

        def _replace(self, _map = map, **kwds):
            return self._make(_map(kwds.get, ('x', 'y'), self))


    print Point(11, 22)._replace(x = 100)
    Point3D = namedtuple('Point3D', Point._fields + ('z',))
    print Point3D.__doc__
    import doctest
    TestResults = namedtuple('TestResults', 'failed attempted')
    print TestResults(*doctest.testmod())